Generalized b-Symbol Weights of Linear Codes and b-Symbol MDS Codes
نویسندگان
چکیده
Generalized pair weights of linear codes are generalizations minimum symbol-pair weights, which were introduced by Liu and Pan (2022) recently. can be used to characterize the ability protecting information in read wire-tap channels type II. In this paper, we introduce notion generalized $b$ -symbol over finite fields, is a generalization Hamming weights. We obtain some basic properties bounds called Singleton-like for As examples, calculate weight matrices simplex codes. provide necessary sufficient condition code MDS using generator matrix parity check code. Finally, isomorphism preserving between two obtained. corollary, get classical MacWilliams extension theorem when notation="LaTeX">$b=1$ .
منابع مشابه
New constructions of MDS symbol-pair codes
Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with large minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining maximal mi...
متن کاملAn optimum symbol-by-symbol decoding rule for linear codes
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
متن کاملB-symbol Distance Distribution of Repeated-root Cyclic Codes
Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitations of the reading process in high-density data storage technologies. Yaakobi et al. [8] introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we come up with a me...
متن کاملMaximum distance separable codes for b-symbol read channels
Recently, Yaakobi et al. introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we establish a Singleton-type bound on b-symbol codes. Codes meeting the Singleton-type bound are called maximum distance separable (MDS) codes, and they are optimal in the sense they attain the maximal minimum bdistance. Based on...
متن کاملSymbol-by-Symbol MAP Decoding of Variable Length Codes
In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3223729